Double Dispersion Representation of Vertex Function

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vertex Equitable Labeling of Double Alternate Snake Graphs

Let G be a graph with p vertices and q edges and A = {0, 1, 2, . . . , [q/2]}. A vertex labeling f : V (G) → A induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. For a ∈ A, let vf (a) be the number of vertices v with f(v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |vf (a) − vf (b)| ≤ 1 and the indu...

متن کامل

‏‎interpersonal function of language in subtitling

‏‎translation as a comunicative process is always said to be associated with various aspects of meaning loss or gain. subtitling as a mode of translating, due to special discoursal and textual conditions imposed upon it, is believed to be an obvious case of this loss or gain. presenting the spoken sound track of a film in writing and synchronizing the perception of this text by the viewers with...

15 صفحه اول

Total Coloring of Certain Double Vertex Graphs

In this paper we investigate the total coloring number for double vertex graphs of some of the most common classes of graphs. Mathematics Subject Classification: 05C15

متن کامل

Structure of the Vertex Function

The discussion of Euclidean Green's functions will be continued in another publication. Note added il proof It h.—as not been suKciently emphasized in this paper that the term "Lorentz gauge, " as descriptive of a gauge in which there is no distinguished time-like vector, refers to a class rather than just the special gauge used in the paper. One can also introduce, for example, the transverse ...

متن کامل

vertex equitable labeling of double alternate snake graphs

let g be a graph with p vertices and q edges and a = {0, 1, 2, . . . , [q/2]}. a vertex labeling f : v (g) → a induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. for a ∈ a, let vf (a) be the number of vertices v with f(v) = a. a graph g is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in a, |vf (a) − vf (b)| ≤ 1 and the in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Progress of Theoretical Physics

سال: 1961

ISSN: 0033-068X

DOI: 10.1143/ptp.25.720